Implementing Petri Net Transformations using Graph Transformation Tools
نویسندگان
چکیده
Petri net transformations have been defined formally in the abstract framework of adhesive HLR categories, which allows rule-based rewriting of graphlike structures, similar to graph transformation. In this paper we discuss differences between Petri net rewriting and graph rewriting which makes it necessary to add checks and conditions when implementing Petri net transformations using an existing graph transformation tool like AGG. The extensions concern the preservation of Petri net transition firing behavior and the mapping of markings. As a running example, we present the RON environment, a visual editor, simulator and net transformation tool for reconfigurable Petri nets which has been developed as a plug-in for ECLIPSE based on the graph transformation engine AGG.
منابع مشابه
Formal Relationship between Petri Net and Graph Transformation Systems based on Functors between M-adhesive Categories
Various kinds of graph transformations and Petri net transformation systems are examples of M -adhesive transformation systems based on M -adhesive categories, generalizing weak adhesive HLR categories. For typed attributed graph transformation systems, the tool environment AGG allows the modeling, the simulation and the analysis of graph transformations. A corresponding tool for Petri net tran...
متن کاملTransfer of Local Confluence and Termination between Petri Net and Graph Transformation Systems Based on M-Functors
Recently, a formal relationship between Petri net and graph transformation systems has been established using the new framework of M -functors F : (C1,M1) → (C2,M2) between M -adhesive categories. This new approach allows to translate transformations in (C1,M1) into corresponding transformations in (C2,M2) and, vice versa, to create transformations in (C1,M1) from those in (C2,M2). This is help...
متن کاملForschungsberichte der Fakultät IV – Elektrotechnik und Informatik Transfer of Local Confluence and Termination between Petri Net and Graph Transformation Systems Based on M-Functors: Extended Version
Recently, a formal relationship between Petri net and graph transformation systems has been established using the new framework of M-functors F : (C1,M1) → (C2,M2) between M-adhesive categories. This new approach allows to translate transformations in (C1,M1) into corresponding transformations in (C2,M2) and, vice versa, to create transformations in (C1,M1) from those in (C2,M2). This is helpfu...
متن کاملPetri Net Transformations
Modelling the adaption of a system to a changing environment gets more and more important. Application areas cover e.g. computer supported cooperative work, multi agent systems, dynamic process mining or mobile networks. One approach to combine formal modelling of dynamic systems and controlled model adaption are Petri net transformations. The main idea behind net transformation is the stepwise...
متن کاملGraph Transformation and Other Rule-Based Formalisms with Incomplete Information
A general framework is presented for extending graph transformation and other rule-based formalisms in such a way that transformations with incomplete information can be handled. This extension is motivated by the need to model the behaviour of open systems in different application areas using graph transformations and Petri nets. The following two problems are central within this general frame...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- ECEASST
دوره 14 شماره
صفحات -
تاریخ انتشار 2008